Optimal Linear Codes From Projective Groups
نویسندگان
چکیده
Since for interesting parameters these Diophantine linear systems are quite big and can not be solved by contemporary computer methods, we further reduce the size of the system by restricting the search to codes with a prescribed group of automorphisms, see also [1]. Then, in many cases the resulting systems can be solved by algorithms for lattice point enumeration [4]. With this approach many new optimal codes for Fq, q ∈ {2, 3, 5, 7, 8}, have been constructed.
منابع مشابه
Families of optimal OOCs with λ = 2
We provide a new construction yielding one new and one known infinite family of optimal (n, w, 2)-optical orthogonal codes, w ∈ {4, 6}. Our construction relies on various techniques in finite projective spaces involving hyperovals in projective planes and Singer groups.
متن کاملPacking and Covering Properties of CDCs and Subspace Codes
Codes in the projective space over a finite field, referred to as subspace codes, and in particular codes in the Grassmannian, referred to as constant-dimension codes (CDCs), have been proposed for error control in random network coding. In this paper, we first study the covering properties of CDCs. We determine some fundamental geometric properties of the Grassmannian. Using these properties, ...
متن کاملCharacterization of some projective special linear groups in dimension four by their orders and degree patterns
Let $G$ be a finite group. The degree pattern of $G$ denoted by $D(G)$ is defined as follows: If $pi(G)={p_{1},p_{2},...,p_{k}}$ such that $p_{1}
متن کاملOptimal Simplices and Codes in Projective Spaces
We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto unknown families of simplices in quaternionic projective spaces and the octonionic projective plane. The most noteworthy cases are 15-point simplices in HP2 and 27-point simplices in OP2, both of which a...
متن کاملOptical Orthogonal Codes from Singer Groups
We construct some new families of optical orthogonal codes that are asymptotically optimal. In particular, for any prescribed value of λ, we construct infinite families of (n, w, λ)-OOCs that in each case are asymptotically optimal. Our constructions rely on various techniques in finite projective spaces involving normal rational curves and Singer groups. These constructions generalize and impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004